Random Fibonacci Sequences
نویسنده
چکیده
We study the random Fibonacci tree, which is an infinite binary tree with non-negative numbers at each node defined as follows. The root consists of the number 1 with a single child also the number 1. Then we define the tree recursively in the following way: if x is the parent of y, then y has two children, namely |x−y| and x+y. This tree was studied by Benoit Rittaud [?] who proved that any pair of integers a, b that are coprime occur as a parent-child pair infinitely often. We extend his results by giving tight upper and lower bounds on the number of such occurrences for any specific coprime pair (a, b) at any specific level down the tree.
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملToeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملOn the Periodicity of Certain Recursive Sequences
In 2000, Viswanath showed that random Fibonacci sequences grow exponentially and calculated the rate at which they grow assuming the coin flipped was fair. In this paper, we explore the Fibonacci sequences generated by finite, repeating sequences of pluses and minuses. The main results of this paper will be to show the necessary conditions for a sequence to be periodic, as well as to show all t...
متن کاملA Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence
In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore, new sequences have been used in order to introduce a new class of series. All properties of the se...
متن کاملThe Asymptotic Growth Rate of Random Fibonacci Type Sequences Ii
In this paper, we use ergodic theory to compute the aysmptotic growth rate of a family of random Fibonacci type sequences. This extends the result in [2]. We also prove some Lochs-type results regarding the effectiveness of various number theoretic expansions.
متن کاملOn some properties and applications of Horadam sequences
The Horadam sequence is a generalization of the Fibonacci numbers in the complex plane, depending on a family of four complex parameters: two recurrence coefficients and two initial conditions. The necessary and sufficient periodicity conditions formulated in [1] are used to enumerate all Horadam sequences with a given period [2]. The geometry of periodic orbits is analyzed, where regular star-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016